Computing the λ-Seeds of a String
نویسندگان
چکیده
We study the λ-seed problem of a string in this paper. Given a string x of length n and an integer λ, the λ-seed problem is to find all the sets of λ substrings of x that cover a superstring of x, assuming that each element of the set is of equal length. We present an efficient algorithm that can compute all the λ-seeds of x in O(n) time.
منابع مشابه
Algorithms for Computing the λ-regularities in Strings
We introduce the notion of λ-regularities in strings that consist of λ-covers and λ-seeds, and study three λ-regularities problems— the λ-cover problem, the general λ-cover problem and the λ-seed problem in this paper. λ-regularities can be viewed as generalized string regularities in the sense that a set of λ repetitive strings rather than a single repeated string are considered. We first pres...
متن کامل[hal-00742061, v1] Efficient Seeds Computation Revisited
The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty. The problem is not well understood, no linear time algorithm is known. In t...
متن کاملComputing repetitive structures in indeterminate strings
We study the problem of finding local and global covers and repetitive structures called seeds in indeterminate strings. An indeterminate string is a sequence X̃ = X̃[1]X̃ [2] . . . X̃[n], where X̃[i] ⊆ Σ for each i, and Σ is a given alphabet of fixed size. We present an algorithm for finding the smallest cover of the string x in O(nlogn) time, where n is the length of the string n. Then we extend t...
متن کاملEfficient Seeds Computation Revisited
The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty. The problem is not well understood, no linear time algorithm is known. In t...
متن کاملConservative String Covering of Indeterminate Strings
We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T [1]T [2] . . . T [n], where T [i] ⊆ Σ for each i, and Σ is a given alphabet of fixed size. A conservative indeterminate string, is an indeterminate string where the number of indeterminate symbols in the positions of the string, i.e the non-...
متن کامل